Algebraic Analysis of a Simplified Encryption Algorithm GOST R 34.12-2015

Algebraic Cryptanalysis of GOST Encryption Algorithm

This paper observes approaches to algebraic analysis of GOST 28147-89 encryption algorithm (also known as simply GOST), which is the basis of most secure information systems in Russia. The general idea of algebraic analysis is based on the representation of initial encryption algorithm as a system of multivariate quadratic equations, which define relations between a secret key and a cipher text...

STRIBOB: Authenticated Encryption from GOST R 34.11-2012 LPS Permutation

Authenticated encryption algorithms protect both the confidentiality and integrity of messages in a single processing pass. In this note we show how to utilize the L◦P ◦S transform of the Russian GOST R 34.11-2012 standard hash “Streebog” to build an efficient, lightweight algorithm for Authenticated Encryption with Associated Data (AEAD) via the Sponge construction and BLNK padding. The propos...

Algebraic Complexity Reduction and Cryptanalysis of GOST

GOST 28147-89 is a well-known Russian government encryption standard. Its large key size of 256 bits at a particularly low implementation cost [77] make that it is widely implemented and used [66, 96, 62, 77, 82]. In 2010 GOST was submitted to ISO to become an international standard. GOST was analysed by Schneier, Biham, Biryukov, Dunkelman, Wagner, various Australian, Japanese, and Russian sci...

A New Fast Data Encryption Algorithm (FDE)

A New Fast Data Encryption Algorithm (FDE)